Computing the Minkowski Sum of Prisms
نویسندگان
چکیده
Within this paper we study the Minkowski sum of prisms (" Cephoids ") in a finite dimensional vector space. For a vector a ∈ R n with positive components we write ¯ a = (1 ¯ a 1 1 ¯ an) and denote by = ¯ a = {x ∈ R n || ¯ a, x 1 , x 0} the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities.
منابع مشابه
A Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کاملOn the Parameterized Computation of Minimum Volume Outer Ellipsoid of Minkowski Sum of Ellipsoids
We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of ellipsoids. We clarify connections among several parameterizations available in the literature, obtain novel analysis results regarding the conditions of optimality, and based on the same, propose two new algorithms for computing the paramet...
متن کاملComputing faces up to k dimensions of a Minkowski Sum of Polytopes
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.
متن کاملComputing All Faces of the Minkowski Sum of V-Polytopes
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 35 شماره
صفحات -
تاریخ انتشار 2006